Optimization-Based Linear Network Coding for General Connections of Continuous Flows
نویسندگان
چکیده
منابع مشابه
CoCo: Coding-Based Covert Timing Channels for Network Flows
In this paper, we propose CoCo, a novel framework for establishing covert timing channels. The CoCo covert channel modulates the covert message in the inter-packet delays of the network flows, while a coding algorithm is used to ensure the robustness of the covert message to different perturbations. The CoCo covert channel is adjustable: by adjusting certain parameters one can trade off differe...
متن کاملOn continuous network flows
This work addresses two problems concerning continuous dynamic flows. A model is presented for a network that incorporates continuous time-varying flows, link capacities, node storage capacities, as well as time dependent link delays. It is an enhancement of previous results which do not incorporate time varying link delays. We present a generalized min-cut max-flow theorem for that model. A se...
متن کاملA Neural Network for Nonlinear Optimization with General Linear Constraints
In this study, we investigate a novel neural network for solving nonlinear convex programming problems with general linear constraints. Furthermore, we extend this neural network to solve a class of variational inequalities problems. These neural networks are stable in the sense of Lyapunov and globally convergent to a unique optimal solution. The present convergence results do not requires Lip...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2018
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2018.2865534